منابع مشابه
Studying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملQuestion Identification Using a Probabilistic Context Free Grammar
This paper shows that using the tree structure generated from a Probabilistic Context Free Grammar parser adds meaningful information to language processing tasks, in particular, question identification. By using a part-of-speech representation of a sentence as a base line, this paper’s results show that adding features derived from the tree output of a Probabilistic Context Free Grammar parser...
متن کاملProbabilistic Context-Free Grammar Induction Based on Structural Zeros
We present a method for induction of concise and accurate probabilistic contextfree grammars for efficient use in early stages of a multi-stage parsing technique. The method is based on the use of statistical tests to determine if a non-terminal combination is unobserved due to sparse data or hard syntactic constraints. Experimental results show that, using this method, high accuracies can be a...
متن کاملA Probabilistic Context-free Grammar for Disambiguation in Morphological Parsing
One of the major problems one is faced with when decomposing words into their constituent parts is ambiguity: the generation of multiple analyses for one input word, many of which are implausible. In order to deal with ambiguity, the MORphological PArser MORPA is provided with a probabilistic context-free grammar (PCFG), i.e. it combines a "conventional" context-free morphological grammar to fi...
متن کاملAutomatic Melodic Reduction Using a Supervised Probabilistic Context-Free Grammar
This research explores a Natural Language Processing technique utilized for the automatic reduction of melodies: the Probabilistic Context-Free Grammar (PCFG). Automatic melodic reduction was previously explored by means of a probabilistic grammar [11] [1]. However, each of these methods used unsupervised learning to estimate the probabilities for the grammar rules, and thus a corpusbased evalu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Natural Language Processing
سال: 1996
ISSN: 1340-7619,2185-8314
DOI: 10.5715/jnlp.3.4_103